//
// Created by lfm on 25-4-21.
//
#include <iostream>
#include <algorithm>
#include <deque>
using namespace std;

void printDeque(deque<int> & d)
{
    for (auto it = d.begin(); it != d.end(); it ++)
    {
        cout << *it << " ";
    }
    cout << endl;
}


void test01()
{
    deque<int>d1;
    d1.push_back(10);
    d1.push_back(325);
    d1.push_back(532);
    d1.push_back(345);
    d1.push_back(543);
    d1.push_back(43);

    printDeque(d1);

    sort(d1.begin(), d1.end());
    printDeque(d1);
}

int main()
{
    test01();
    return 0;
}
